Rooted Spiral Trees on Hyper-cubical Lattices
نویسنده
چکیده
We study rooted spiral trees in 2, 3 and 4 dimensions on a hyper cubical lattice using exact enumeration and Monte-Carlo techniques. On the square lattice, we also obtain exact lower bound of 1.93565 on the growth constant λ. Series expansions give θ = −1.3667 ± 0.001 and ν = 1.3148 ± 0.001 on a square lattice. With Monte-Carlo simulations we get the estimates as θ = −1.364 ± 0.01, and ν = 1.312 ± 0.01. These results are numerical evidence against earlier proposed dimensional reduction by four in this problem. In dimensions higher than two, the spiral constraint can be implemented in two ways. In either case, our series expansion results do not support the proposed dimensional reduction. Spiral structures are very common in nature. Some examples of the beautiful spiral structures in galaxies, shoot arrangement in plants, polymers with spiral structure etc may be found in the book by Hargittai [1]. In statistical mechanics, lattice models of spiral self avoiding walks have been studied and can be solved exactly in two dimension [2, 3], though no solution is known for the self avoiding walks without the spiral constraint. A model of spiral trees and animals was proposed by Li and Zhou [4], which based on numerical studies was suggested to be in a new universality class. This problem was further studied by Bose et. al [5]. Based on the numerical evidence, and guided by the fact that magnetic field acting perpendicular to the motion of a charged particle produces spiralling motion and reduction by two in effective dimensionality, they conjectured that
منابع مشابه
Spiral Trees on Hyper - cubic lattices
We study rooted spiral trees in 2, 3 and 4 dimensions on a hyper cubic lattice using exact enumeration and Monte-Carlo techniques. On the square lattice, we also obtain exact lower bound of 1.93565 on the growth constant λ. Series expansions give θ = −1.3667± 0.0010 and ν = 0.6574± 0.0010 on a square lattice. With Monte-Carlo simulations we get the estimates as θ = −1.364±0.010, and ν = 0.656±0...
متن کاملFree hyperplane arrangements associated to labeled rooted trees
To each labeled rooted tree is associated a hyperplane arrangement, which is free with exponents given by the depths of the vertices of this tree. The intersection lattices of these arrangements are described through posets of forests. These posets are used to define coalgebras, whose dual algebras are shown to have a simple presentation by generators and relations.
متن کاملCellular Spanning Trees and Laplacians of Cubical Complexes
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit formulas for spanning tree enumerators and Laplacian eigenvalues of cubes; the latter are integers. We prove a weighted version of the eigenvalue formula, pr...
متن کاملAn algebraic approach to coarse graining
We propose that Kreimer’s method of Feynman diagram renormalization via a Hopf algebra of rooted trees can be fruitfully employed in the analysis of block spin renormalization or coarse graining of inhomogeneous statistical systems. Examples of such systems include spin foam formulations of non-perturbative quantum gravity as well as lattice gauge and spin systems on irregular lattices and/or w...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004